Chromatic capacities of graphs and hypergraphs
نویسندگان
چکیده
منابع مشابه
Complete Subgraphs of Chromatic Graphs and Hypergraphs
In this note we consider k-chromatic graphs with given colour k r-graphs have vertex sets u C i , and no r-tuple (i .e. edge o f 1 the r-graph) has two vertices in the same colour class C i .
متن کاملDecomposing complete edge-chromatic graphs and hypergraphs
A d-graph G = (V ;E1, . . . , Ed) is a complete graph whose edges are colored by d colors, or in other words, are partitioned into d subsets (some of which might be empty). We say that G is complementary connected if the complement to each chromatic component of G is connected on V , or in other words, if for each two vertices u, w ∈ V and color i ∈ I = {1, . . . , d} there is a path between u ...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملChromatic number of finite and infinite graphs and hypergraphs
First we state a few simple finite problems . Chromatic graphs attracted the attention of mathematicians first of all because of the four colour problem, but it was soon realized that interesting and difficult questions can be proved on chromatic graphs which have nothing to do with the four colour problem (or Appel and Haken theorem) . Tutte (and independently Ungar, Zykov and Mycielski) prove...
متن کاملDecomposing complete edge-chromatic graphs and hypergraphs. Revisited
A d-graph G = (V ;E1, . . . , Ed) is a complete graph whose edges are colored by d colors, or in other words, are partitioned into d subsets (some of which might be empty). We say that G is complementary connected if the complement to each chromatic component of G is connected on V , or in other words, if for each two vertices u,w ∈ V and color i ∈ I = {1, . . . , d} there is a path between u a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2004
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.06.016